Anesthesiology Nurse Scheduling using Particle Swarm Optimization
نویسندگان
چکیده
منابع مشابه
Anesthesiology Nurse Scheduling using Particle Swarm Optimization
In this article we present an approach designed to solve a real world problem: the Anesthesiology Nurse Scheduling Problem (ANSP) at a public French hospital. The anesthesiology nurses are one of the most shared resources in the hospital and we attempt to find a fair/balanced schedule for them, taking into account a set of constraints and the nurses’ stated preferences, concerning the different...
متن کاملDiversified Particle Swarm Optimization for Hybrid Flowshop Scheduling
The aim of this paper is to propose a new particle swarm optimization algorithm to solve a hybrid flowshop scheduling with sequence-dependent setup times problem, which is of great importance in the industrial context. This algorithm is called diversified particle swarm optimization algorithm which is a generalization of particle swarm optimization algorithm and inspired by an anarchic society ...
متن کاملGrid Scheduling using Improved Particle Swarm Optimization with Digital Pheromones
Scheduling is one of the core steps to efficiently exploit the capabilities of emergent computational systems such as grid computing. Grid environment is a dynamic, heterogenous and unpredictable computing system which shares different services among various users. Because of heterogenous and dynamic nature of the grid, the methods used in traditional systems could not be applied to grid schedu...
متن کاملTask Scheduling in Distributed Systems using Discrete Particle Swarm Optimization
Finding an optimal schedule of tasks for an application in distributed environment is critical in general. Task assignment is an extremely NP complete problem. This type of problem can be resolved by heuristic algorithms efficiently because the traditional methods such as dynamic programming and the back tracking need more time for solving this NP complete problem. Particle Swarm Optimization (...
متن کاملParticle Swarm Optimization for Constrained Instruction Scheduling
Instruction scheduling is an optimization phase aimed at balancing the performance-cost tradeoffs of the design of digital systems. In this paper, a formal framework is tailored in particular to find an optimal solution to the resource-constrained instruction scheduling problem in high-level synthesis. The scheduling problem is formulated as a discrete optimization problem and an efficient popu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Intelligence Systems
سال: 2012
ISSN: 1875-6891,1875-6883
DOI: 10.1080/18756891.2012.670525